On Minimal Perimeter Polyminoes
نویسندگان
چکیده
This paper explores proofs of the isoperimetric inequality for 4-connected shapes on the integer grid Z, and its geometric meaning. Pictorially, we discuss ways to place a maximal number unit square tiles on a chess board so that the shape they form has a minimal number of unit square neighbors. Previous works have shown that “digital spheres” have a minimum of neighbors for their area. We here characterize all shapes that are optimal and show that they are all close to being digital spheres. In addition, we show a similar result when the 8-connectivity metric is assumed (i.e. connectivity through vertices or edges, instead of edge connectivity as in 4-connectivity).
منابع مشابه
A Note on Sets of Finite Perimeter in the Plane
The aim of this paper is to study the minimal perimeter problem for sets containing a fixed set E in R2 in a very general setting, and to give the explicit solution. This Article is Dedicated to Paolo Marcellini on the Occasion of His Sixtieth Birthday
متن کاملContainment of a pair of rotating objects within a container of minimal area or perimeter
Cutting and packing problems arise in many fields of applications and theory. When dealing with irregular objects, an important subproblem is the identification of the optimal clustering of two objects. Within this paper we consider the case, where two irregular one-connected objects whose frontier formed by circular and/or line segments and which can be free rotated, should be placed such that...
متن کاملتعیین مناسب ترین شکل و اندازه پلات برای برآورد چند متغیر مرتعی در مراتع نیمه استپی
Proper judgement on rangeland state needs appropriate sampling plan and accurately estimation of plant characteristics. Sample shape and size are critical issues in vegetation measurement. Thus, decision on appropriate quadrate shape that enables us to determine several parameters accurately and timely would increase sampling efficiency. Several criterias including accuracy, perimeter/area rati...
متن کاملSharp \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$N^{3/4}$$\end{document}N3/4 Law for the Minimizers of the Edge-Isoperimetric Problem on the Triangular Lattice
We investigate the edge-isoperimetric problem (EIP) for sets of n points in the triangular lattice by emphasizing its relation with the emergence of the Wulff shape in the crystallization problem. By introducing a suitable notion of perimeter and area, EIP minimizers are characterized as extremizers of an isoperimetric inequality: they attain maximal area and minimal perimeter among connected c...
متن کاملOn implementation of the minimal perimeter triangle enclosing a convex polygon algorithm
A high-level description of an algorithm which computes the minimum perimeter triangle enclosing a convex polygon in linear time exists in the literature. Besides that an implementation of the algorithm is given in the subsequent work. However, that implementation is incomplete and omits certain common cases. This note’s contribution consist of a modern treatment of the algorithm and its conseq...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006